On the role of strongly connected components in argumentation
نویسندگان
چکیده
In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics has been introduced to solve the problems related to counterintuitive results produced by literature proposals. In this semantics, extensions can be decomposed and constructed along the strongly connected components of the defeat graph. This paper proves that this property holds also in the context of all semantics encompassed by Dung’s framework, showing that strongly connected components may play a general role in the definition and computation of argumentation semantics.
منابع مشابه
Refining SCC decomposition in argumentation semantics: a first investigation
In the recently proposed SCC-recursive approach to argumentation semantics, the strongly connected components of an argumentation framework are used as the basic elements for the incremental construction of extensions. In this paper we argue that a finer decomposition, considering some suitably defined internal substructures of strongly connected components, called autonomous fragments, may be ...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملCF2-extensions as Answer-set Models
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. Since extension-based argumentation semantics were formalized in terms of relationships between atomic arguments, it has been shown that extension-based argumentation semantics based on admissible sets such as stable semantics can be characterized in terms of answer sets. In this pap...
متن کاملA recursive approach to argumentation: motivation and perspectives
In the context of Dung’s argumentation framework, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected components of the argumentation framework. We introduce the fundamental notion of SCCrecursiveness and show that all Dung’s admissibilitybased semantics are SCC-recursive, and therefore a special case of our schema. The space of...
متن کامل